Free Search in Tracking Time Dependent Optima
نویسنده
چکیده
The article presents an adaptive method, called Free Search. It implements ideas different from other evolutionary algorithms such as Genetic Algorithms, Particle Swarm Optimisation, Differential Evolution and Ant Colony Optimisation. Free Search is based on original concepts for individual intelligence and independence of the population members. It is applied to optimisation of time dependent data and tries to find and to track optimal solutions, which change their locations during the period of search. The aim is to find an answer to the question how Free Search behaves when the global optimum leaves the search space. The achieved experimental results are presented and discussed. Key-Words: Free Search, Adaptive Computing, Dynamic Optimisation, Evolutionary Computation, Heuristic Methods.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملA Gravitational Search Algorithm-Based Single-Center of Mass Flocking Control for Tracking Single and Multiple Dynamic Targets for Parabolic Trajectories in Mobile Sensor Networks
Developing optimal flocking control procedure is an essential problem in mobile sensor networks (MSNs). Furthermore, finding the parameters such that the sensors can reach to the target in an appropriate time is an important issue. This paper offers an optimization approach based on metaheuristic methods for flocking control in MSNs to follow a target. We develop a non-differentiable optimizati...
متن کاملA Time Dependent Pollution Routing Problem in Multi-graph
This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost. In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...
متن کاملSearch, Binary Representations and Counting Optima
Choosing a good representation is a vital component of solving any search problem. However, choosing a good representation for a problem is as diicult as choosing a good search algorithm for a problem. Wolpert and Macready's No Free Lunch theorem proves that no search algorithm is better than any other over all possible discrete functions. We elaborate on the No Free Lunch theorem by proving th...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کامل